On the length of the longest exact position match in a Markov sequence
نویسنده
چکیده
A mixed Poisson approximation and a Poisson approximation for the length of the longest exact match of a Markov sequence across another sequence are provided, where the match is required to start at position 1 in the first sequence. This problem arises when looking for suitable anchors in whole genome alignments. ∗AMS 2000 subject classifications. 62E17, 92D20. †
منابع مشابه
A Further Note on Runs in Independent Sequences
Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملAn Erdos - Rhyi taw with Shifts RICHARD
Motivated by the comparison of DNA sequences, a generalization is given of the result of Erdos and Renyi on the length R, of the longest run of heads in the first n tosses of a coin. Suppose that all the " letters " are independent and identically distributed. The length of the longest match without shifts has the same distribution as R, , the length of the longest head run for a biased coin wi...
متن کاملOn Runs in Independent Sequences
Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.
متن کاملApplication of Markov Processes to the Machine Delays Analysis
Production and non-productive equipment and personnel delays are a critical element of any production system. The frequency and length of delays impact heavily on the production and economic efficiency of these systems. Machining processes in wood industry are particularly vulnerable to productive and non-productive delays. Whereas, traditional manufacturing industries usually operate on homoge...
متن کامل